Selected Topics in the Extremal Graph Theory
نویسنده
چکیده
Extremal problems in graph theory form a very wide research area. We study the following topics: the metric dimension of circulant graphs, the Wiener index of trees of given diameter, and the degree‐diameter problem for Cayley graphs. All three topics are connected to the study of distances in graphs. We give a short survey on the topics and present several new results.
منابع مشابه
Problems and results in Extremal Combinatorics - III
Extremal Combinatorics is one of the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science, Geometry and Game Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers. The topics c...
متن کاملProblems and results in Extremal Combinatorics ... IIIT1
Extremal Combinatorics is one of the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science, Geometry and Game Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers. The topics c...
متن کاملExtremal Graph Theory
Extremal graph theory is, broadly speaking, the study of relations between various graph invariants, such as order, size, connectivity, minimum/maximum degree, chromatic number, etc., and the values of these invariants that ensure that the graph has certain properties. Since the first major result by Turan in 1941, numerous mathematicians have contributed to make this a vibrant and deep subject...
متن کاملTopics in Extremal Combinatorics - Notes
3 Lecture 3 8 3.1 Krivelevich’s proof that r(3, k) ≥ ck2/ log k . . . . . . . . . . . . . . . . . . . . . . . 8 3.2 Ajtai-Komlós-Szemerédi’s r(3, k) < ck2/ log k . . . . . . . . . . . . . . . . . . . . . . 9 3.3 AKS Intuition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.4 AKS formal proof . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملProblems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoretical Computer Science, Geometry and Game Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers. The topi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016